An algorithm to find two distance domination parameters in a graph
نویسندگان
چکیده
منابع مشابه
An Algorithm to Find Two Distance Domination Parameters in a Graph
Let n > 1 be an integer and let G be a graph of order p. A set 9 of vertices of G is a total n-dominating set of G if every vertex of V(G) is within distance n from some vertex of .P’ other than itself. The minimum cardinal@ among all total n-dominating sets of G is called the total n-domination number and is denoted by “J:(G). A set S of vertices of G is n-independent if the distance (in G) be...
متن کاملGraph Domination in Distance Two
Let G = (V, E) be a graph, and k ≥ 1 an integer. A subgraph D is said to be k-dominating in G if every vertex of G−D is at distance at most k from some vertex of D. For a given class D of graphs, DomkD is the set of those graphs G in which every connected induced subgraph H has some k-dominating induced subgraph D ∈ D which is also connected. In our notation, DomD coincides with Dom1D. In this ...
متن کاملBounds on the Distance Two-Domination Number of a Graph
For a graph G = (V , E), a subset D V ðGÞ is said to be distance two-dominating set in G if for each vertex u 2 V D, there exists a vertex v 2 D such that dðu; vÞ 2. The minimum cardinality of a distance two-dominating set in G is called a distance twodomination number and is denoted by c2ðGÞ. In this note we obtain various upper bounds for c2ðGÞ and characterize the classes of graphs attaining...
متن کاملAlgorithm to Find All Cliques in a Graph
Algorithm to Find All Cliques in a Graph A. Ashok Kumar Department of Computer Science , St. Xavier’s College (Autonomous), Palayamkottai 627 002. E-mail: [email protected] S. Athisayanathan Research Department of Mathematics, St. Xavier’s College (Autonomous),Palayamkottai 627 002. E-mail: [email protected] A. Antonysamy Research Department of Mathematics, St. Xavier’s College...
متن کاملNote: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S ⊆ V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a factor total dominating set if in every Fi every vertex in V is adjacent to a vertex in S. The cardinality of a smallest such set is the factor (total) domination number. In this note we investigate bounds on the factor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00057-x